A Knowledge-Based Technique for Constraints Satisfaction in Manpower Allocation
نویسندگان
چکیده
We show that knowledge-based techniques are as effective as mathematical techniques when satisfying constraints for solving manpower allocation problems. These techniques can be used to fulfill the corresponding local and global constraints based on the dynamic programming algorithm. It uses tools borrowed from genetic and simulated annealing algorithms, and fuzzy logic methodologies. The schedules produced by our algorithm match the best schedules produced by human experts.
منابع مشابه
Constraint Allocation in Analog System Synthesis
In this paper we present a technique for constraint allocation in analog system synthesis. Constraint allocation is the process of assigning constraint budgets to the subsystems so that the user asserted system level constraints are satissed. Our approach is based on the formulation of the constraint allocation problem as a constraint satisfaction problem (CSP) and solving it. The solution meth...
متن کاملGenerating Optimal Timetabling for Lecturers using Hybrid Fuzzy and Clustering Algorithms
UCTTP is a NP-hard problem, which must be performed for each semester frequently. The major technique in the presented approach would be analyzing data to resolve uncertainties of lecturers’ preferences and constraints within a department in order to obtain a ranking for each lecturer based on their requirements within a department where it is attempted to increase their satisfaction and develo...
متن کاملBeyond the Glass Box: Constraints as Objects
Constraint Logic Programming (CLP) is a very active research area. One reason being that nite domain CLP systems have been successfully applied to various combinatorial optimization problems such as time tabling, scheduling, frequency allocation, manpower planning, production planning. State of the art nite domain CLP languages o er programming constructs that gives access to the state of the c...
متن کاملAllocation Algorithms in Dynamic Negotiation-Based Coalition Formation
In this paper, we present a set of allocation algorithms for a dynamic, negotiation-based coalition formation model. The model is for a cooperative multiagent system in which each agent has incomplete information about its dynamic and uncertain world and must respond to sensed events within time constraints. With incomplete information and uncertain world parameters while lacking time, an agent...
متن کاملA Bi-level Formulation for Centralized Resource Allocation DEA Models
In this paper, the common centralized DEA models are extended to the bi-level centralized resource allocation (CRA) models based on revenue efficiency. Based on the Karush–Kuhn–Tucker (KKT) conditions, the bi-level CRA model is reduced to a one-level mathematical program subject to complementarity constraints (MPCC). A recurrent neural network is developed for solving this one-level mathematica...
متن کامل